52 research outputs found
Combinatorial Voter Control in Elections
Voter control problems model situations such as an external agent trying to
affect the result of an election by adding voters, for example by convincing
some voters to vote who would otherwise not attend the election. Traditionally,
voters are added one at a time, with the goal of making a distinguished
alternative win by adding a minimum number of voters. In this paper, we
initiate the study of combinatorial variants of control by adding voters: In
our setting, when we choose to add a voter~, we also have to add a whole
bundle of voters associated with . We study the computational
complexity of this problem for two of the most basic voting rules, namely the
Plurality rule and the Condorcet rule.Comment: An extended abstract appears in MFCS 201
Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality
Recommended from our members
COMMENTS ON ""ALTERNATIVE BID VARIABLES AS INSTRUMENTS OF OCS LEASING POLICY,"" BY MEAD, MOSEIDJORD AND MURAOKA
Recommended from our members
Bridging the gap between first-and second-price auctions with drawable winning bids
An Options-Based Method to Solve the Composability Problem in Sequential Auctions
(Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Juda, Adam I., and David C. Parkes. 2005. An options-based method to solve the composability problem in sequential auctions
- …